On Probabilistic Knowledge
نویسندگان
چکیده
منابع مشابه
On Probabilistic Checking in Perfect Zero Knowledge
We present the first constructions of single-prover proof systems that achieve perfect zero knowledge (PZK) for languages beyond NP, under no intractability assumptions: 1. The complexity class #P has PZK proofs in the model of Interactive PCPs (IPCPs) [KR08], where the verifier first receives from the prover a PCP and then engages with the prover in an Interactive Proof (IP). 2. The complexity...
متن کاملReasoning with Models of Probabilistic Knowledge over Probabilistic Knowledge
In multi-agent systems, the knowledge of agents about other agents’ knowledge often plays a pivotal role in their decisions. In many applications, this knowledge involves uncertainty. This uncertainty may be about the state of the world or about the other agents’ knowledge. In this thesis, we answer the question of how to model this probabilistic knowledge and reason about it efficiently. Modal...
متن کاملProbabilistic Knowledge Bases
We deene a new xpoint semantics for rule-based reasoning in the presence of imprecise information. We rst demonstrate the need to have such a rule-based semantics by showing a real-world application requiring such reasoning. We then deene this semantics. Optimizations and approximations of the semantics are shown so as to make the semantics amenable to very large scale real-world applications. ...
متن کاملTowards Probabilistic Knowledge Bases
We deene a new xpoint semantics for rule-based reasoning in the presence of vague or imprecise information. Such a semantics should fullll two requirements. First, it must coincide with the intuitive understanding of the given information, and second, the semantics must be computationally tractable. We show that our semantics fulllls the rst requirement and we formally verify that our xpoint se...
متن کاملProbabilistic Knowledge-Based Programs
We introduce Probabilistic Knowledge-Based Programs (PKBPs), a new, compact representation of policies for factored partially observable Markov decision processes. PKBPs use branching conditions such as if the probability of φ is larger than p, and many more. While similar in spirit to valuebased policies, PKBPs leverage the factored representation for more compactness. They also cope with more...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Res Philosophica
سال: 2020
ISSN: 2168-9105
DOI: 10.11612/resphil.1856